Reaching Your Goals without Spilling the Beans: Boolean Secrecy Games
نویسندگان
چکیده
Inspired by the work on Boolean games, we present turnbased games where each of the players controls a set of atomic variables and each player wants to achieve some individual goal in such a way that the other players remain unaware of the goal until it is actually achieved. We present definitions of winning such games with hidden goals for different non-cooperative settings, and discuss in which types of situations players have winning or equilibrium strategies. We also provide some complexity bounds on deciding whether a player has a winning strategy.
منابع مشابه
Decentralized Computation of Pareto Optimal Pure Nash Equilibria of Boolean Games with Privacy Concerns
In Boolean games, agents try to reach a goal formulated as a Boolean formula. These games are attractive because of their compact representations. However, few methods are available to compute the solutions and they are either limited or do not take privacy or communication concerns into account. In this paper we propose the use of an algorithm related to reinforcement learning to address this ...
متن کاملDependency in Cooperative Boolean Games
Cooperative boolean games are coalitional games with both goals and costs associated to actions, and dependence networks for boolean games are a kind of social networks representing how the actions of other agents have an influence on the achievement of an agent’s goal. In this paper, we introduce two new types of dependence networks, called the abstract dependence network and the refined depen...
متن کاملDecentralized Computation of Pareto Optimal Pure Nash Equilibria of Boolean Games with Privacy Concerns
In Boolean games, agents try to reach a goal formulated as a Boolean formula. These games are attractive because of their compact representations. However, few methods are available to compute the solutions and they are either limited or do not take privacy or communication concerns into account. In this paper we propose the use of an algorithm related to reinforcement learning to address this ...
متن کاملEndogenous Boolean Games
In boolean games players exercise control over propositional variables and strive to achieve a goal formula whose realization might require the opponents’ cooperation. Recently, a theory of incentive engineering for such games has been devised, where an external authority steers the outcome of the game towards certain desirable properties consistent with players’ goals, by imposing a taxation m...
متن کاملBoolean Games with Epistemic Goals
We introduce and formally study games in which the goals of players relate to the epistemic states of players in the game. For example, one player might have a goal that another player knows a certain proposition, while another player might have as a goal that a certain player does not know some proposition. The formal model we use to study epistemic games is a variation of the increasingly pop...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013